The local catenativity of DOL-sequences in free communitative monoids is decidable in the binary case
نویسنده
چکیده
Given a matrix A el.* and a vector V0e1. 2 we détermine if there exists an integer m— 1 m and m positive integers am^1 . . . aQ such that A m VQ— £ axA l VQ. When such an m exists^ we compute the smallest one and m positive integers am^.1 . . . a0 that satisfy the relation.
منابع مشابه
تأثیر باکتری آزوسپیریلوم بر برخی شاخص‌های رشد و عملکرد سه رقم گندم
Azospirillum brasilense is one of the N2-fixing microorganisms which, in symbiosis with the roots of cereals and other graminae, enhances growth and development of plants. In this research, wheat seeds (Triticum aestivum) of three cultivars (Ghods, Roshan and Omid) were inoculated with Azospirillum strains (Sp7 and Dol). Inoculation increased growth parameters and yield of wheat cultivars, the ...
متن کاملتأثیر باکتری آزوسپیریلوم بر برخی شاخص‌های رشد و عملکرد سه رقم گندم
Azospirillum brasilense is one of the N2-fixing microorganisms which, in symbiosis with the roots of cereals and other graminae, enhances growth and development of plants. In this research, wheat seeds (Triticum aestivum) of three cultivars (Ghods, Roshan and Omid) were inoculated with Azospirillum strains (Sp7 and Dol). Inoculation increased growth parameters and yield of wheat cultivars, the ...
متن کاملOn the Periodicity of Morphisms on Free Monoids
— For a given endomorphism h on a finitely generaled jree monoid there are only flnitely many primitive words w for which h(w) = w for some n^2. Also, one can effectively find ail such w. Using this it is shown that it is decidable whether or not a morphism h defines an ultimately periodic infinité word when iterated on a given word. This latter resuit thus solves the DOL periodicity problem. R...
متن کاملInnnite Convergent String-rewriting Systems and Cross-sections for Monoids
A nitely presented monoid has a decidable word problem if and only if it can be presented by some left-recursive convergent string-rewriting system if and only if it has a recursive cross-section. However, context-free cross-sections or even regular cross-sections do not suuce. This is shown by presenting examples of nitely presented monoids with decidable word problems that do not admit regula...
متن کاملSolvability of Equations in Free Partially Commutative Groups Is Decidable
Trace monoids are well-studied objects in computer science where they serve as a basic algebraic tool for analyzing concurrent systems. The question whether the existential theory of trace equations is decidable has been solved positively in 1996. Free partially commutative groups (graph groups) generalize trace monoids in the sense that every element has an inverse. In this paper we show that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 26 شماره
صفحات -
تاریخ انتشار 1992